Using simulated annealing to design good codes

نویسندگان

  • Abbas El Gamal
  • Lane A. Hemaspaandra
  • Itzhak Shperling
  • Victor K.-W. Wei
چکیده

A NNEAL, as defined in Webster’s New Collegiate Dictionary, means: 1) to heat (as glass) in order to fix laid-on colors, and 2) to heat and then cool (as steel or glass) usually for softening and making less brittle. The cooling stage of annealing is usually done slowly to reduce the number of defects in the crystal structure (as steel) and to minimize the potential energy stored in the molecular configuration (as glass). A fundamental question in statistical mechanics concerns whether the system solidifies in the limit of low temperature, and if it does, whether it forms a crystalline solid or a glass. Motivated by a subtlety in numerical integration, the Metropolis algorithm [l] has often been used to simulate numerically the annealing process to gain an understanding of the ground-state configuration. A typical combinatorial optimization problem seeks the minimum of a given objective (or cost) function of many variables. The variables are subject to intertwining constraints, and they interact with each other in complicated ways not unlike the molecules in a physical system. By appropriately defining an effective temperature for the multivariable system and imitating the physical annealing process, researchers have sought to solve a diverse collection of problems, with varying degrees of success. Kirkpatrick [2] first investigated the use of simulated annealing in connection with the physical design of com-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method

In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is us...

متن کامل

Using design of experiments approach and simulated annealing algorithm for modeling and Optimization of EDM process parameters

The main objectives of this research are, therefore, to assess the effects of process parameters and to determine their optimal levels machining of Inconel 718 super alloy. gap voltage, current, time of machining and duty factor are tuning parameters considered to be study as process input parameters. Furthermore, two important process output characteristic, have been evaluated in this research...

متن کامل

Robust inter and intra-cell layouts design model dealing with stochastic dynamic problems

In this paper, a novel quadratic assignment-based mathematical model is developed for concurrent design of robust inter and intra-cell layouts in dynamic stochastic environments of manufacturing systems. In the proposed model, in addition to considering time value of money, the product demands are presumed to be dependent normally distributed random variables with known expectation, variance, a...

متن کامل

A simulated annealing approach to solve the network design of one-way streets: case of Shiraz network

This study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (SA) algorithm to solve this problem for a large real network. It discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

متن کامل

New Constructions for q-ary Covering Codes

Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 33  شماره 

صفحات  -

تاریخ انتشار 1987